Three improvements to the top-down solver

Abstract The local solver TD is a generic fixpoint engine which explores given system of equations on demand. It has been successfully applied to the interprocedural analysis procedural languages. gains efficiency by detecting dependencies between unknowns fly. This algorithm recently extended deal with widening and narrowing as well. In particular, it equipped an automatic detection points. That version, however, only guaranteed terminate under two conditions: finitely many are encountered, all right-hand sides monotonic . While first condition unavoidable, second limits applicability solver. Another limitation that maintains current abstract values encountered instead minimal set sufficient for performing iteration. By consuming unnecessarily much space, analyses may not succeed seemingly small programs. present paper, we therefore extend top-down in three ways. First, indicate how restriction can be lifted without compromising termination. We then show tuned store when their preservation inevitable. Finally, also side-effecting equation systems. Right-hand these provide corresponding left-hand side but at same time produce contributions other unknowns. practical extension used seamless combination context-sensitive (e.g., states) flow-insensitive globals).